Compact elliptic curve representations

نویسندگان

  • Mathieu Ciet
  • Jean-Jacques Quisquater
  • Francesco Sica
چکیده

Let y D x C ax C b be an elliptic curve over Fp , p being a prime number greater than 3, and consider a; b 2 Œ1; p. In this paper, we study elliptic curve isomorphisms, with a view towards reduction in the size of elliptic curves coefficients. We first consider reducing the ratio a=b. We then apply these considerations to determine the number of elliptic curve isomorphism classes. Later we work on both coefficients. We introduce the number M.p/ as the lower bound of all M 2 N such that each isomorphism class has a representative with max.a; b/ < M . Using results from the theory of uniform distributions, we prove upper and lower bounds of the form c1p < M.p/ < c2p with explicit constants c1; c2 > 0.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography

Techniques for fast exponentiation (multiplication) in various groups have been extensively studied for use in cryptographic primitives. Specifically, the coding of the exponent (multiplier) plays an important role in the performances of the algorithms used. The crucial optimization relies in general on minimizing the Hamming weight of the exponent (multiplier). This can be performed optimally ...

متن کامل

Securing Elliptic Curve Point Multiplication against Side-Channel Attacks

For making elliptic curve point multiplication secure against side-channel attacks, various methods have been proposed using special point representations for specifically chosen elliptic curves. We show that the same goal can be achieved based on conventional elliptic curve arithmetic implementations. Our point multiplication method is much more general than the proposals requiring non-standar...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Power Operations in Elliptic Cohomology and Representations of Loop Groups

The first part describes power operations in elliptic cohomology in terms of isogenies of the underlying elliptic curve. The second part discusses a relationship between equivariant elliptic cohomology and representations of loop groups. The third part investigates the representation theoretic considerations which give rise to the power operations discussed in the first part.

متن کامل

SL(2;R)/U(1) Supercoset and Elliptic Genera of Non-compact Calabi-Yau Manifolds

We first discuss the relationship between the SL(2;R)/U(1) supercoset and N = 2 Liouville theory and make a precise correspondence between their representations. We shall show that the discrete unitary representations of SL(2;R)/U(1) theory correspond exactly to those massless representations of N = 2 Liouville theory which are closed under modular transformations and studied in our previous wo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Mathematical Cryptology

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2011